package STUDENT.TRANNGUYENQUAN.OOPs.array.bai1;

public class Models {
	public int CountPosNumber(ArrSoce arr, int n) {
		int dem = 0;
		for (int i = 0; i < n; i++) {
			if (arr.getArrSoce()[i] >= 5)
				dem++;
		}
		return dem;
	}

	public int CountNeNumber(ArrSoce arr, int n) {
		int dem = 0;
		for (int i = 0; i < n; i++) {
			if (arr.getArrSoce()[i] < 5)
				dem++;
		}
		return dem;
	}

	public boolean checkNumber(int number) {
		boolean isNumberAvai = true;
		if (number < 0 || number > 10)
			isNumberAvai = false;
		return isNumberAvai;
	}

	public void EnterNumber(ArrSoce arr, int number, int position) {
		arr.setArrSoce(number, position);
	}
}
